package leetcode.D2000.T1254;

import util.GraphUtil;

/**
 * @File Info: leetcode -- <M1254>
 * @Author: 18362
 * @Create: 2022-02-26 12:51:02 星期六
 */
public class M1254 {
    public static void main(String[] args) {
        int[][] grid = GraphUtil.parseGraph("[[1,1,1,1,1,1,1,0],[1,0,0,0,0,1,1,0]," +
                "[1,0,1,0,1,1,1,0],[1,0,0,0,0,1,0,1],[1,1,1,1,1,1,1,0]]");
//        int[][] grid = GraphUtil.parseGraph("[[0,0,1,0,0],[0,1,0,1,0],[0,1,1,1,0]]");
//        int[][] grid = GraphUtil.parseGraph("[[1,1,1,1,1,1,1],[1,0,0,0,0,0,1],[1,0,1,1,1,0,1]," +
//                "[1,0,1,0,1,0,1],[1,0,1,1,1,0,1],[1,0,0,0,0,0,1],[1,1,1,1,1,1,1]]");
        GraphUtil.printGraph(grid);
        System.out.println(new Solution().closedIsland(grid));
    }
}
